Parameter ecology for Feedback Vertex Set

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Subset Feedback Vertex Set Is Fixed-Parameter Tractable

The classical FEEDBACK VERTEX SET problem asks, for a given undirected graph G and an integer k, to find a set of at most k vertices that hits all the cycles in the graph G. FEEDBACK VERTEX SET has attracted a large amount of research in the parameterized setting, and subsequent kernelization and fixed-parameter algorithms have been a rich source of ideas in the field. In this paper we consider...

متن کامل

Directed Feedback Vertex Set is Fixed-Parameter Tractable

We resolve positively a long standing open question regarding the fixed-parameter tractability of the parameterized Directed Feedback Vertex Set problem. In particular, we propose an algorithm which solves this problem in O(8k! ∗ poly(n)).

متن کامل

9.2 Minimum Feedback Vertex Set

Roughly speaking, the local ratio method works iteratively, and in each iteration it breaks a suitable structure (the local structure) to solve from the residual structure in that iteration. Typically the local structure is an instance that is very easy to solve. The main claim that is required is that the solution to the local structure can be patched with the solution from the next iteration,...

متن کامل

Faster deterministic Feedback Vertex Set

We present two new deterministic algorithms for the Feedback Vertex Set problem parameterized by the solution size. We begin with a simple algorithm, which runs in O((2 + φ)) time, where φ < 1.619 is the golden ratio. It already surpasses the previously fastest O((1+ 2 √ 2))-time deterministic algorithm due to Cao et al. [SWAT 2010]. In our developments we follow the approach of Cao et al., how...

متن کامل

Linear-Time Kernelization for Feedback Vertex Set

In this paper, we give an algorithm that, given an undirected graph G of m edges and an integer k, computes a graph G′ and an integer k′ in O(km) time such that (1) the size of the graph G′ is O(k), (2) k′ ≤ k, and (3) G has a feedback vertex set of size at most k if and only if G′ has a feedback vertex set of size at most k′. This is the first linear-time polynomial-size kernel for Feedback Ve...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Tsinghua Science and Technology

سال: 2014

ISSN: 1007-0214

DOI: 10.1109/tst.2014.6867520